Vector space formulation of probabilistic finite state automata
نویسندگان
چکیده
منابع مشابه
Vector space formulation of probabilistic finite state automata
Article history: Received 16 January 2010 Received in revised form 21 December 2011 Accepted 7 February 2012 Available online 10 February 2012
متن کاملLearning Probabilistic Residual Finite State Automata
We introduce a new class of probabilistic automata: Probabilistic Residual Finite State Automata. We show that this class can be characterized by a simple intrinsic property of the stochastic languages they generate (the set of residual languages is finitely generated) and that it admits canonical minimal forms. We prove that there are more languages generated by PRFA than by Probabilistic Dete...
متن کاملMenger probabilistic normed space is a category topological vector space
In this paper, we formalize the Menger probabilistic normed space as a category in which its objects are the Menger probabilistic normed spaces and its morphisms are fuzzy continuous operators. Then, we show that the category of probabilistic normed spaces is isomorphicly a subcategory of the category of topological vector spaces. So, we can easily apply the results of topological vector spaces...
متن کاملPAC-learnability of Probabilistic Deterministic Finite State Automata
We study the learnability of Probabilistic Deterministic Finite State Automata under a modified PAC-learning criterion. We argue that it is necessary to add additional parameters to the sample complexity polynomial, namely a bound on the expected length of strings generated from any state, and a bound on the distinguishability between states. With this, we demonstrate that the class of PDFAs is...
متن کاملLearning Probabilistic Finite Automata
Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of these finite state machines. In the setting of identification in the limit with probability one, we prove that stochastic deterministic finite automata cannot be identified from only a polynomial quantity of data. If concerned wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2012
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2012.02.001